翻訳と辞書 |
Constraint automaton : ウィキペディア英語版 | Constraint automaton In computer science, Constraint automata are a formalism to describe the behavior and possible data flow in coordination models.〔("Linear Temporal Logic of Constraint Automata" ) by Sara Navidpour and Mohammad Izadi, Department of Mathematical Science, Sharif University of Technology, Tehran, Iran.〕 It was introduced by Arbab et al.〔("Effective Modeling of Software Architectural Assemblies Using Constraint Automata" ) by Nikunj R. Mehta, Marjan Sirjani, and Farhad Arbab. CWI Technical Report SEN-R0309, October 22, 2003.〕 as a variation of finite automata for model checking Reo connector circuits. Constraint automata can be considered generalizations of probabilistic automata, in which data constraints, instead of probabilities, label state transitions and influence their firing. ==See also==
* Model checking * Finite automata * Probabilistic automaton * Colored Petri net
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Constraint automaton」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|